An Algebra of Concurrent Non-Deterministic Processes

نویسندگان

  • Ludmila Cherkasova
  • Vadim E. Kotov
چکیده

Cherkasova, L.A., and V.E. Kotov, An algebra of concurrent nondeterminstic processes, Theoretical Computer Science 90 (1991) 151-170. This paper illustrates how early ideas and simple naive concepts of concurrency theory of the 1960s have now turned into complex and subtle problems of modern calculi of concurrent processes. An algebra of finite processes AFP, is discussed as an example of research which incorporates various aspects of typical process calculi: axiomatization of the proposed algebra, adequate description of “true concurrency” semantics for processes, compositionality and full abstractness in the algebra, handling exceptional situations, etc.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

BCK-ALGEBRAS AND HYPER BCK-ALGEBRAS INDUCED BY A DETERMINISTIC FINITE AUTOMATON

In this note first we define a BCK‐algebra on the states of a deterministic finite automaton. Then we show that it is a BCK‐algebra with condition (S) and also it is a positive implicative BCK‐algebra. Then we find some quotient BCK‐algebras of it. After that we introduce a hyper BCK‐algebra on the set of all equivalence classes of an equivalence relation on the states of a deterministic finite...

متن کامل

Verification of Random Behaviours

We introduce abstraction in a probabilistic process algebra. The process algebra can be employed for specifying processes that exhibit both probabilistic and non-deterministic choices in their behaviours. Several rules and axioms are identified, allowing us to rewrite processes to less complex processes by removing redundant internal activity. Using these rules, we have successfully conducted a...

متن کامل

Concurrent Refinement Algebra and Rely Quotients

The concurrent refinement algebra developed here is designed to provide a foundation for rely/guarantee reasoning about concurrent programs. The algebra builds on a complete lattice of commands by providing sequential composition, parallel composition and a novel weak conjunction operator. The weak conjunction operator coincides with the lattice supremum providing its arguments are non-aborting...

متن کامل

Upward Saturated Hyperclones

Hyperoperations are mappings that assign a non-void subset of a set to each n-tuple of elements from the set. They present a fundamental notion for modeling non deterministic processes. Even though for each non deterministic automaton there is a language equivalent deterministic automaton, they do not have the same behavior. As behavior of concurrent processes took place in emerging fields of t...

متن کامل

The algebra of stream processing functions

Dataaow networks are a model of concurrent c o m p u-tation. They consist of a collection of concurrent asynchronous processes which communicate by sending data over FIFO c hannels. In this paper we study the algebraic structure of the dataaow networks and base their semantics on stream processing functions. The algebraic theory is provided by the calculus of ownomials which g i v es a uniied p...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Theor. Comput. Sci.

دوره 90  شماره 

صفحات  -

تاریخ انتشار 1991